Essentials of numerical nonsmooth optimization
نویسندگان
چکیده
Abstract Approximately sixty years ago two seminal findings, the cutting plane and subgradient methods, radically changed landscape of mathematical programming. They provided, for first time, practical chance to optimize real functions several variables characterized by kinks , namely discontinuities in their derivatives. Convex functions, which a superb body theoretical research was growing parallel, naturally became main application field choice. The aim paper is give concise survey key ideas underlying successive development area, took name numerical nonsmooth optimization. focus will be, particular, on mainstreams generated under impulse initial discoveries.
منابع مشابه
Potentialities of Nonsmooth Optimization
In this paper, we show that higher-order optimality conditions can be obtain for arbitrary nonsmooth function. We introduce a new higher-order directional derivative and higher-order subdifferential of Hadamard type of a given proper extended real function. This derivative is consistent with the classical higher-order Fréchet directional derivative in the sense that both derivatives of the same...
متن کاملControl via Nonsmooth Optimization ∗
We present a new approach to mixed H 2 /H∞ output feedback control synthesis. Our method uses nonsmooth mathematical programming techniques to compute locally optimal H 2 /H∞-controllers, which may have a predefined structure. We prove global convergence of our method and present tests to validate it numerically. 1. Introduction. Mixed H 2 /H ∞ output feedback control is a prominent example of ...
متن کاملEigenvalues and nonsmooth optimization
Variational analysis concerns the geometry and calculus of nonsmooth sets and functions, often viewed from an optimization perspective. Over several decades, variational analysis has matured into a powerful and elegant theory. One rich source of concrete examples involves the eigenvalues of symmetric and nonsymmetric matrices, sometimes deriving from dynamical or feedback control questions. Thi...
متن کاملNonsmooth Optimization via Bfgs
We investigate the BFGS algorithm with an inexact line search when applied to nonsmooth functions, not necessarily convex. We define a suitable line search and show that it generates a sequence of nested intervals containing points satisfying the Armijo and weak Wolfe conditions, assuming only absolute continuity. We also prove that the line search terminates for all semi-algebraic functions. T...
متن کاملNumerical Differentiation of Noisy, Nonsmooth Data
In many scientific applications, it is necessary to compute the derivative of functions specified by data. Conventional finite-difference approximations will greatly amplify any noise present in the data. Denoising the data before or after differentiating does not generally give satisfactory results see an example in Section 4 . A method which does give good results is to regularize the differe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2022
ISSN: ['1572-9338', '0254-5330']
DOI: https://doi.org/10.1007/s10479-021-04498-y